Improved Cluster Structure Optimization: Hybridizing Evolutionary Algorithms with Local Heat Pulses
نویسندگان
چکیده
منابع مشابه
Improved Cluster Structure Optimization: Hybridizing Evolutionary Algorithms with Local Heat Pulses
Cluster structure optimization (CSO) refers to finding the globally minimal cluster structure with respect to a specific model and quality criterion, and is a computationally extraordinarily hard problem. Here we report a successful hybridization of evolutionary algorithms (EAs) with local heat pulses (LHPs). We describe the algorithm’s implementation and assess its performance with hard benchm...
متن کاملHybridizing local search algorithms for global optimization
In this paper, we combine two types of local search algorithms for global optimization of continuous functions. In the literature, most of the hybrid algorithms are produced by combination of a global optimization algorithm with a local search algorithm and the local search is used to improve the solution quality, not to explore the search space to find independently the global optimum. The foc...
متن کاملThe ensemble clustering with maximize diversity using evolutionary optimization algorithms
Data clustering is one of the main steps in data mining, which is responsible for exploring hidden patterns in non-tagged data. Due to the complexity of the problem and the weakness of the basic clustering methods, most studies today are guided by clustering ensemble methods. Diversity in primary results is one of the most important factors that can affect the quality of the final results. Also...
متن کاملHybridizing Cultural Algorithms and Local Search
In this paper, we propose a new population-based framework for combining local search with global explorations to solve single-objective unconstraint numerical optimization problems. The idea is to use knowledge about local optima found during the search to a) locate promising regions in the search space and b) identify the suitable step size to move from one optimum to others in each region. T...
متن کاملLocal structure and algorithms in nonsmooth optimization
Given a real δ, find stable real polynomials p and q such that the polynomial r(s) = (s − 2δs+ 1)p(s) + (s − 1)q(s) is also stable. (We call a polynomial p stable if its abscissa α(p) = max{Re s : p(s) = 0} is nonpositive.) Clearly the problem is unsolvable if δ = 1, since then r(1) = 0; more delicate results (summarized in [7]) show it remains unsolvable for δ < 1 close to 1. Blondel offered a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Inorganics
سال: 2017
ISSN: 2304-6740
DOI: 10.3390/inorganics5040064